MESSAGE PASSINGAND LOOPS SOLUTION ALGORITHM BASED ON CUT-NODE TREE

Node-Based Genetic Algorithm for Communication Spanning Tree Problem

Genetic Algorithm (GA) and other Evolutionary Algorithms (EAs) have been successfully applied to solve constrained minimum spanning tree (MST) problems of the communication network design and also have been used extensively in a wide variety of communication network design problems. Choosing an appropriate representation of candidate solutions to the problem is the essential issue for applying ...

Implementing a Node Based Split-Tree Search Algorithm

Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies

In this paper, we consider the message forwarding problem that consists in managing the network resources that are used to forward messages. Previous works on this problem provide solutions that either use a significant number of buffers (that is n buffers per processor, where n is the number of processors in the network) making the solution not scalable or, they reserve all the buffers from th...

An Efficient Message Passing Election Algorithm based on Mazurkiewicz's Algorithm

We study the election and the naming problems in the asynchronous message passing model. We present a necessary condition based on Angluin’s lifting lemma [Ang80] that must be satisfied by any network that admits a naming (or an election) algorithm. We then show that this necessary condition is also sufficient: we present an election and naming algorithm based on Mazurkiewicz’s algorithm [Maz97...

Node Redeployment Algorithm Based on Stratified Connected Tree for Underwater Sensor Networks

During the underwater sensor networks (UWSNs) operation, node drift with water environment causes network topology changes. Periodic node location examination and adjustment are needed to maintain good network monitoring quality as long as possible. In this paper, a node redeployment algorithm based on stratified connected tree for UWSNs is proposed. At every network adjustment moment, self-exa...